Although mixing the two programming methods can add complexity to your program, the combination of the two toolkits working together is sometimes required. 尽管混合使用两种编程方法会为程序添加复杂性,但是将这两种工具箱组合起来有时是必须的。
We hope you, too, will be saying "goodbye" to programming complexity soon as you create web applications and web services with ADIEU. 我们希望您通过使用ADIEU创建Web应用程序和Web服务,也能很快和编程的复杂繁琐“说再见”。
A component-based programming model has many benefits, most noticeably reduced complexity. 基于组件的编程模型有许多好处,最显著的好处是可以减少复杂性。
At the same time, developers working in other languages that support concurrent programming have often suffered and struggled with the extraordinarily high complexity that comes along with concurrent primitives like threads and mutexes. 与此同时,使用其他支持并发编程的语言工作的开发人员经常面临伴随线程和mutexes这样的并发原语而来的超高复杂性的困扰。
Since one of the goals for any programming project should be the reduction of complexity for the user, it would be nice to dramatically shrink the code, or at least organize it better. 既然任何编程项目的目标之一是减少用户复杂度,所以最好大幅度缩短代码,或者至少更好地组织代码。
The DataPower XM70 enables you to rapidly deploy LLM routing rules that you can configurable via an intuitive interface without the need for programming, greatly reducing cost and complexity. DataPowerXM70允许您快速部署LLM路由规则,这些路由规则可以通过一个直观的界面进行配置,无需进行编程,这将极大降低成本和复杂性。
Also, it's possible to overcome this problem by using multithreading; however, it introduces another level of programming complexity that has inherent risks in terms of garbage collection. 而且,虽然可以通过使用多线程克服此问题;但是,这导致了另一级别的编程复杂性,该方法存在着垃圾收集方面的固有风险。
Simulation of Active Jamming on Radar Using COM-based Mixed Programming An Utilizing-Interference and Increasing-Capacity Precoding with Low Complexity 基于COM的混合编程实现雷达有源干扰仿真利用干扰提高容量的低复杂度预编码方法
Without complex programming, J2EE simplifies the complexity for developing extensible and scalable enterprise applications by adopting the distributed application model based on the standardized, modular components, providing a complete set of services to those components, and handling many details of application behavior automatically. J2EE平台采用了基于标准化,组件化开发的分布式应用模型,并为这些组件定义了一套完整的服务集合,从而简化了开发易扩展、易伸缩的企业应用的复杂性。
A generalized circuit wiring problem is presented. Some algorithms to this problem based on the dynamic programming and partial order approaches are designed, and the complexity of the proposed algorithms is analyzed. 提出了一种推广的电路布线问题,对此问题分别设计了基于动态规划和偏序关系的算法,并分析了其算法的复杂性。
However, the programming for parallel application still has considerable complexity, furthermore, the static MPI standard provides no fault tolerant mechanism and no dynamic task balance management mechanism. 然而,大规模并行计算应用源码的编制具有相当程度的复杂性,而且静态特征的MPI标准并不提供任何的容错机制和动态任务平衡管理机制。
With the development of the computer programming language, the complexity and size of the software package are continuously increasing. 随着计算机编程语言的飞速发展,软件包的复杂度和容量不断增加。
Recursive is a significant way of solve problem in the something. Using sample of recursive programming, Analyse the Time complexity& Space complexity of recursive program, suggest adapt range of recursive program. 递归是解决一类问题的重要方法,通过递归程序设计实例,分析递归程序的时间和空间复杂度,给出递归程序适应的范围。
With the middleware technology, XML technology and Java programming technology, this paper provides a unified interface for heterogeneous database, which avoids programming many repetitive codes, reduces the software complexity and improve the programming efficiency and developing procedure. 采用了中间件技术、XML技术及Ja-va编程技术,给异构数据库查询用户提供一个统一的接口,避免了重复编程,提高了软件的复用率,加快了软件的开发进程。
And dynamic programming algorithm ( O ( dn2n)), its computing complexity is decreased to O ( dn3)( d is the number of circuits tested, and n is the number of test items to be ordered). 和动态规划算法(O(dn2n))相比,计算复杂度降低为O(dn3)(d表示待测电路的数目,n表示待排序的测试项目的数目)。
The algorithm reduces programming complexity, data relativity and limitation of processor unit's on_ chip memory capacity and suits achievement on multiprocessor platform on which DSP acts as processor unit. 此算法有效地减少了数据的相关性,降低了编程的复杂性,突破了处理单元片内内存容量的限制,适合在一类以DSP为处理单元的多处理机平台上并行实现。
The model is in fact a mixed 0-1 non-linear fuzzy programming model with NP-hard complexity. 该模型属于混合0-1的模糊非线性规划模型,且具有NP难性质。
Optimization design of shovel mechanism of single bucket is nonlinearity programming with complexity bind, and it is difficult to deal with it. 液压挖掘机铲斗连杆机构的优化设计是具有复杂约束的非线性规划问题,最优化求解困难。
An interior point algorithms for a class of linearly constrained convex programming problem and its computational complexity 一类线性约束凸规划问题的内点算法及其计算复杂性
Mutual Exclusion and Synchronization of Concurrent Programming and Its complexity 并发程序设计的互斥、同步及其复杂性
Aspect-oriented programming is a recently developed programming technology that can decrease the complexity and improve maintainability and extensibility of software systems by encapsulating crosscutting concerns into aspects. 面向方面程序设计是近年来提出的一种程序设计技术,通过将横切关注点封装成Aspect,实现软件系统复杂性的降低,系统可维护性和可扩展性的提高。
The computational complexity problem of K-T point in quadratic programming is transformed into linear complementarity's computational complexity problem, and combining with knapsack problem, we obtained that quadratic programming is an NP-hard problem. 将二次规划中K-T点复杂性问题转化为线性互补复杂性问题,并结合背包问题得出二次规划是NP难问题。
Based on the dynamic programming, the computational method of robust low complexity eMPC controller is studied. 4. 并且基于动态规划,研究了鲁棒低复杂度显式模型预测控制的计算方法。
This integer programming or linear programming method requires a lot of computation and the time complexity of computing is higher, searching efficiency is very low when the number of jobs in the project is too large or relation between jobs is complicated. 当项目的工作数量很大或者工作间关系过于复杂时,这种整数规划或者线性规划求解方法就需要大量的计算,时间复杂率较高,寻优效率很低。
In the case of complex situation, the obtained definitive or clear mathematic programming problems are usually nonlinear programming which bring complexity to computing, and even some stochastic or fuzzy problems are difficult to convert to definitive or clear problems. 这是因为,对较复杂的情形,得到的确定或清晰的数学规划通常是非线性规划,给计算带来复杂性,甚至有些问题难以转化为确定或清晰的数学规划问题。
The original method completely depends on integer programming, which has non-polynomial time computational complexity. 原有方法完全依赖整数规划,具有非多项式时间的计算复杂度。
With the multiple applications of stochastic optimization theory, the diversification of the stochastic programming model and the complexity of the model solution, the stochastic theory and its applications are in need of a method to solve the model. 随着随机优化理论的多应用化、随机规划模型的多样化及模型求解的复杂化,随机理论研究及其应用领域均急需寻求一套求解模型的方法。
For three FTs, I introduce a new variable to replace the squared term, putting the nonlinear objective function of the nonlinear programming into linear form, reducing the computational complexity significantly. 对于三个固定终端,本人通过引入一个新的变量来取代平方项,把测距标量算法优化部分的非线性目标函数转变为线性形式,能够显著的减少该算法的计算复杂度。
However, calculated Hessian matrix in the quadratic programming is so difficult for complexity structural of large-scale projects that we need spend much time on it. 但是在二次规划过程中需要计算海森矩阵,对于结构复杂的大型工程来说,计算量太大。
The computing concept of GPU was presented in the very early, but it has not been widely used subject to the programming complexity and accuracy issues. GPU通用计算的概念很早就被提出,但受限于编程复杂度和精度等问题,一直没有得到广泛的应用。